On Schedulability Bounds of Weighted Round Robin Schedulers
نویسندگان
چکیده
We derive a closed-formed schedulability bound for weighted round robin schedulers. The schedulability bound is parameterized for protocol overhead ratio α which measures the portion of time consumed in protocol operations per round, normalized token rotation frequency γ which measures the number of token rotations per Dmin (the shortest relative deadline of the tasks) time interval, the normalized deadline k , which measures the tightness of deadline assignment, the tasks set workload smoothness μ which measures the burstness of the workload. Individual schedulability bounds can be easily obtained by simply plugging in these parameters.
منابع مشابه
Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems
We derive a parameterized, closed-formed schedulability bound for weighted round robin schedulers in hard real-time computing systems. The schedulability bound uses several parameters to represent important system behaviors: (1) Number of tasks; (2) Normalized deadline that measures the tightness of task deadlines; (3) Tasks set workload burst-ness; (4) Overhead ratio, which measures the portio...
متن کاملLatency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms - Networking, IEEE/ACM Transactions on
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an LR server is determined by two parameters—the latency and the allocated rate. Several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, SelfClocked Fair Queueing, Weighted Round Robin...
متن کاملImproving the Flexibility of the Deficit Table Scheduler
A key component for networks with Quality of Service (QoS) support is the egress link scheduler. The table-based schedulers are simple to implement and can offer good latency bounds. Some of the latest proposals of network technologies, like Advanced Switching and InfiniBand, define in their specifications one of these schedulers. However, these schedulers do not work properly with variable pac...
متن کاملDesign Trade-offs in Customized On-chip Crossbar Schedulers
In this paper, we present a design and an analysis of customized crossbar schedulers for reconfigurable on-chip crossbar networks. In order to alleviate the scalability problem in a conventional crossbar network, we propose adaptive schedulers on customized crossbar ports. Specifically, we present a scheduler with a weighted round robin arbitration scheme that takes into account the bandwidth r...
متن کاملVertical dimensioning: A novel DRR implementation for efficient fair queueing
Fair bandwidth allocation is an important mechanism for traffic management in the Internet. Round robin schedulers, such as Deficit Round Robin (DRR), are well-suited for implementing fair queueing in multi-Gbps routers, as they schedule packets in constant time regardless of the total number of active flows. The main drawback of these schemes, however, lies in the maintenance of per flow queue...
متن کامل